1

On the Strength of Ramsey's Theorem for Pairs

Year:
2001
Language:
english
File:
PDF, 1.10 MB
english, 2001
3

Reverse mathematics and infinite traceable graphs

Year:
2012
Language:
english
File:
PDF, 173 KB
english, 2012
4

Strong jump-traceability I: The computably enumerable case

Year:
2008
Language:
english
File:
PDF, 302 KB
english, 2008
7

Subsystems of Second Order Arithmeticby Stephen G. Simpson

Year:
1999
Language:
english
File:
PDF, 104 KB
english, 1999
9

Permutations and Presentations

Year:
1994
Language:
english
File:
PDF, 333 KB
english, 1994
10

INVARIANCE AND NONINVARIANCE IN THE LATTICE OF $\Pi_1^0$ CLASSES

Year:
2004
Language:
english
File:
PDF, 200 KB
english, 2004
13

On the orbits of computably enumerable sets

Year:
2008
Language:
english
File:
PDF, 418 KB
english, 2008
16

Lattice nonembeddings and intervals of the recursively enumerable degrees

Year:
1993
Language:
english
File:
PDF, 2.02 MB
english, 1993
17

Some orbits for E

Year:
2001
Language:
english
File:
PDF, 252 KB
english, 2001
18

The dense simple sets are orbit complete with respect to the simple sets

Year:
1998
Language:
english
File:
PDF, 509 KB
english, 1998
19

Iterated relative recursive enumerability

Year:
1994
Language:
english
File:
PDF, 1.32 MB
english, 1994
20

The translation theorem

Year:
1994
Language:
english
File:
PDF, 1.26 MB
english, 1994
21

Atomlessr-maximal sets

Year:
1999
Language:
english
File:
PDF, 789 KB
english, 1999
23

On -tardy sets

Year:
2012
Language:
english
File:
PDF, 359 KB
english, 2012
27

Generics for computable Mathias forcing

Year:
2014
Language:
english
File:
PDF, 558 KB
english, 2014
28

An Almost Deep Degree

Year:
2001
Language:
english
File:
PDF, 415 KB
english, 2001
30

Maximal Contiguous Degrees

Year:
2002
Language:
english
File:
PDF, 638 KB
english, 2002
31

Uniform Almost Everywhere Domination

Year:
2006
Language:
english
File:
PDF, 1.35 MB
english, 2006
33

Isomorphisms of Splits of Computably Enumerable Sets

Year:
2003
Language:
english
File:
PDF, 577 KB
english, 2003
34

Definable Encodings in the Computably Enumerable Sets

Year:
2000
Language:
english
File:
PDF, 372 KB
english, 2000
36

On the Cantor-Bendixon rank of recursively enumerable sets

Year:
1993
Language:
english
File:
PDF, 883 KB
english, 1993
37

Uniform almost everywhere domination

Year:
2006
Language:
english
File:
PDF, 1.15 MB
english, 2006
38

Maximal contiguous degrees

Year:
2002
Language:
english
File:
PDF, 2.02 MB
english, 2002
41

The Complexity of Orbits of Computably Enumerable Sets

Year:
2008
Language:
english
File:
PDF, 2.72 MB
english, 2008
42

${\cal D}$-MAXIMAL SETS

Year:
2015
Language:
english
File:
PDF, 316 KB
english, 2015
43

Boolean Algebras and Orbits of the Lattice of R.E. Sets Modulo the Finite Sets

Year:
1990
Language:
english
File:
PDF, 459 KB
english, 1990
45

DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES

Year:
2017
Language:
english
File:
PDF, 323 KB
english, 2017
46

Effective prime uniqueness

Year:
2017
Language:
english
File:
PDF, 227 KB
english, 2017
47

The Rado path decomposition theorem

Year:
2019
Language:
english
File:
PDF, 238 KB
english, 2019
49

The Notre Dame Lectures || Model theory of difference fields

Year:
2016
File:
PDF, 507 KB
2016
50

The Notre Dame Lectures || Preface

Year:
2016
File:
PDF, 36 KB
2016